An axiomatic basis for bidirectional programming

An axiomatic study of infinite basis

We present a new technique for studying the w-axiomatizability of the semantics in the ltbt-spectrum. Although Fokkink et al. have recently solved most of the problems still open, our main goal is to shed light on them, and to simply and unify their proofs. Besides, we will focus on preorders (and make a fundamental use of the axiom for ready simulation semantics) instead of equivalences, since...

A System for Axiomatic Programming

We present the design and implementation of a system for axiomatic programming, and its application to mathematical software construction. Key novelties include a direct support for user-defined axioms establishing local equalities between types, and overload resolution based on equational theories and user-defined local axioms. We illustrate uses of axioms, and their organization into concepts...

An Axiomatic Semantics of Concurrent Programming Languages

An Axiomatic Basis for Reasoning about Trust in PKIs

Trust is essential to a communication channel. The trust relationships, which play an important role in Public Key Infrastructures (PKIs), need to be formalized for providing a reliable modelling methodology to support secure digital communications. In this paper, we present a typed modal logic used for specifying and reasoning about trust in PKIs. In order to study trust relationships within P...

Foundations for Bidirectional Programming